On Geometric Evolution and Cascadic Multigrid in Subdivision
نویسندگان
چکیده
A new approach to subdivision based on the evolution of surfaces under curvature motion is presented. Such an evolution can be understood as a natural geometric filter process where time corresponds to the filter width. Thus, subdivision can be interpreted as the application of a geometric filter on an initial surface. The approach closely connects subdivision to surface fairing concerning the geometric smoothing and to cascadic multigrid methods with respect to the actual numerical procedure. The derived method does not distinguish between different valences of nodes nor between different mesh refinement types.
منابع مشابه
A cascadic geometric filtering approach to subdivision
A new approach to subdivision based on the evolution of surfaces under curvature motion is presented. Such an evolution can be understood as a natural geometric filter process where time corresponds to the filter width. Thus, subdivision can be interpreted as the application of a geometric filter on an initial surface. The concrete scheme is a model of such a filtering based on a successively i...
متن کاملPii: S0167-8396(02)00150-4
A new approach to subdivision based on the evolution of surfaces under curvature motion is presented. Such an evolution can be understood as a natural geometric filter process where time corresponds to the filter width. Thus, subdivision can be interpreted as the application of a geometric filter on an initial surface. The concrete scheme is a model of such a filtering based on a successively i...
متن کاملVariable Order Cascadic Multigrid Algorithms
Cascadic multigrid algorithms have been shown by a number of researchers (e.g., Bornemann, Deuflhard, Shaidurov, Shi, and many others) to be useful in a number of application areas. Cascadic multigrid differs from traditional one way multigrid methods by over solving the problem on coarse grids in order to reduce the required work on the finest grids. Since there is a geometric growth in the nu...
متن کاملA Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise...
متن کاملClassical and Cascadic Multigrid | a Methodical Comparison Classical and Cascadic Multigrid | a Methodical Comparison
Using the full multigrid method without any coarse grid correction steps but with an a posteriori control of the number of smoothing iterations was shown by Bornemann and Deuuhard 2] to be an optimal iteration method with respect to the energy norm. They named this new kind of multigrid iteration the cascadic multigrid method. However, numerical examples with linear nite elements raised serious...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001